238 research outputs found
Local non-Bayesian social learning with stubborn agents
We study a social learning model in which agents iteratively update their
beliefs about the true state of the world using private signals and the beliefs
of other agents in a non-Bayesian manner. Some agents are stubborn, meaning
they attempt to convince others of an erroneous true state (modeling fake
news). We show that while agents learn the true state on short timescales, they
"forget" it and believe the erroneous state to be true on longer timescales.
Using these results, we devise strategies for seeding stubborn agents so as to
disrupt learning, which outperform intuitive heuristics and give novel insights
regarding vulnerabilities in social learning
High order finite element calculations for the deterministic Cahn-Hilliard equation
In this work, we propose a numerical method based on high degree continuous
nodal elements for the Cahn-Hilliard evolution. The use of the p-version of the
finite element method proves to be very efficient and favorably compares with
other existing strategies (C^1 elements, adaptive mesh refinement, multigrid
resolution, etc). Beyond the classical benchmarks, a numerical study has been
carried out to investigate the influence of a polynomial approximation of the
logarithmic free energy and the bifurcations near the first eigenvalue of the
Laplace operator
Structural Results and Applications for Perturbed Markov Chains
Each day, most of us interact with a myriad of networks: we search for information on the web, connect with friends on social media platforms, and power our homes using the electrical grid. Many of these interactions have improved our lives, but some have caused new societal issues - social media facilitating the rise of fake news, for example. The goal of this thesis is to advance our understanding of these systems, in hopes improving beneficial interactions with networks while reducing the harm of detrimental ones.
Our primary contributions are threefold. First, we devise new algorithms for estimating Personalized PageRank (PPR), a measure of similarity between the nodes in a network used in applications like web search and recommendation systems. In contrast to most existing PPR estimators, our algorithms exploit local graph structure to reduce estimation complexity. We show the analysis of such algorithms is tractable for certain random graph models, and that the key insights obtained from these models hold empirically for real graphs.
Our second contribution is to apply ideas from the PPR literature to two other problems. First, we show that PPR estimators can be adapted to the policy evaluation problem in reinforcement learning. More specifically, we devise policy evaluation algorithms inspired by existing PPR estimators that leverage certain side information to reduce the sample complexity of existing methods. Second, we use analytical ideas from the PPR literature to show that convergence behavior and robustness are intimately related for a certain class of Markov chains.
Finally, we study social learning over networks as a model for the spread of fake news. For this model, we characterize the learning outcome in terms of a novel measure of the “density” of users spreading fake news. Using this characterization, we also devise optimal strategies for seeding fake news spreaders so as to disrupt learning. These strategies empirically outperform intuitive heuristics on real social networks (despite not being provably optimal for such graphs) and thus provide new insights regarding vulnerabilities in social learning.
While the topics studied in this thesis are diverse, a unifying mathematical theme is that of perturbed Markov chains. This includes perturbations that yield useful interpretations in various applications, that provide algorithmic and analytical advantages, and that disrupt some underlying system or process. Throughout the thesis, the perturbed Markov chain theme guides our analysis and suggests more general methodologies.PHDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/155213/1/dvial_1.pd
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits
The study of collaborative multi-agent bandits has attracted significant
attention recently. In light of this, we initiate the study of a new
collaborative setting, consisting of agents such that each agent is
learning one of stochastic multi-armed bandits to minimize their group
cumulative regret. We develop decentralized algorithms which facilitate
collaboration between the agents under two scenarios. We characterize the
performance of these algorithms by deriving the per agent cumulative regret and
group regret upper bounds. We also prove lower bounds for the group regret in
this setting, which demonstrates the near-optimal behavior of the proposed
algorithms.Comment: To appear in the proceedings of ICML 202
Computations of the first eigenpairs for the Schrödinger operator with magnetic field
International audienceThis paper is devoted to computations of eigenvalues and eigenvectors for the Schrödinger operator with constant magnetic field in a domain with corners, as the semi-classical parameter tends to . The eigenvectors corresponding to the smallest eigenvalues concentrate in the corners: They have a two-scale structure, consisting of a corner layer at scale and an oscillatory term at scale . The high frequency oscillations make the numerical computations particularly delicate. We propose a high order finite element method to overcome this difficulty. Relying on such a discretization, we illustrate theoretical results on plane sectors, squares, and other straight or curved polygons. We conclude by discussing convergence issues
- …